-
1 hashing algorithm
Англо-русский словарь нормативно-технической терминологии > hashing algorithm
-
2 hashing algorithm
= hash algorithmкласс алгоритмов, обеспечивающих быстрый доступ к данным, различаемым по некоторому ключевому значению (key value), например по имени человека или имени файла; это ключевое значение преобразуется хэш-функцией в число, используемое как индекс для хэш-таблицы, где содержатся указатели на реальные записи данных. Эффективный алгоритм должен иметь хэш-функцию, распределяющую ключи и элементы данных широко и равномерно, причём не требуя чрезмерного увеличения размера хэш-таблицы. В частном случае, в отличие от шифрования, необратимая функция, используемая для защиты паролей от просмотра. Например, MD5 password hash algorithm - алгоритм хэширования паролей в шифре MD5Англо-русский толковый словарь терминов и сокращений по ВТ, Интернету и программированию. > hashing algorithm
-
3 hashing algorithm
Безопасность: алгоритм перемешивания, алгоритм хеширования -
4 hashing algorithm
алгоритм перемешивания (хеширования); алгоритм рандомизацииАнгло-русский словарь по компьютерной безопасности > hashing algorithm
-
5 hashing algorithm
вчт алгоритм хеширования -
6 hashing algorithm
вчт. алгоритм хешированияThe New English-Russian Dictionary of Radio-electronics > hashing algorithm
-
7 algorithm
алгоритм (cryptoalgorithm) криптографический алгоритм, криптоалгоритм; алгоритм шифрования (криптографического закрытия)- private cryptographic algorithmАнгло-русский словарь по компьютерной безопасности > algorithm
-
8 algorithm
1) алгоритм2) правило; процедура; метод•- adaptive algorithm
- Agarval-Cooley algorithm
- aim algorithm
- annealing algorithm
- asymmetric encryption algorithm
- autoregressive algorithm
- backoff algorithm
- back propagation of error algorithm
- batch algorithm
- Bellman-Ford algorithm
- best cost path algorithm
- bisection algorithm
- branch and bound algorithm - CART algorithm
- channel algorithm
- channel routing algorithm
- Cholesky algorithm
- classification and regression tree algorithm
- clustering algorithm
- Cochran-Orcutt algorithm
- compression algorithm
- conjugate directions algorithm
- conjugate gradients algorithm
- constructive algorithm
- contour following algorithm
- control algorithm
- convolution algorithm
- Cooley-Tuckey algorithm
- cryptographic algorithm
- deflation compression algorithm
- differential synthesis algorithm
- Diffie-Hellman algorithm
- digital signal processing algorithm
- digital signature algorithm
- Dijkstra algorithm
- distance vector algorithm
- DSP algorithm
- dynamic programming algorithm
- edge-tracking algorithm
- evolutionary algorithm
- exact embedding algorithm
- expansion algorithm
- fast algorithm
- fast convolution Agarval-Cooley algorithm
- fixed-weight algorithm
- Ford-Fulkerson algorithm
- fundamental algorithm
- fuzzy algorithm
- general algorithm - greedy algorithm
- Gummel's algorithm
- hashing algorithm
- heuristic algorithm
- ID3 algorithm
- identification algorithm
- initialization algorithm
- integer algorithm - iterative dichotomizer 3 algorithm
- k-means algorithm
- learning algorithm
- least frequently used algorithm
- least recently used algorithm
- Lee-Moore algorithm
- Lee algorithm
- Lee-type algorithm
- Lempel-Ziv algorithm
- Lempel-Ziv-Welch algorithm
- Levenberg-Marquardt algorithm
- LFU algorithm
- line-probe algorithm
- link state algorithm
- LU decomposition algorithm
- LZ algorithm
- LZW algorithm
- MacQueen's k-means algorithm
- McCulloch-Pitts algorithm
- memetic algorithm - min-cut algorithm - nested algorithm
- numerical algorithm
- Oja iterative algorithm
- on-line algorithm
- optimization algorithm
- ordering algorithm
- painter's algorithm
- parallel algorithm
- pattern classification algorithm
- pattern recognition algorithm
- pel-recursive estimation algorithm
- placement algorithm
- planning algorithm
- polynomial algorithm
- predictive algorithm
- preemptive algorithm
- Prim algorithm
- production rule based algorithm
- pruning algorithm
- pseudo least recently used algorithm
- quantum search algorithm
- quick-union algorithm
- quick-union algorithm with path compression
- Q-R-algorithm
- radix sorting algorithm
- randomized algorithm
- rank algorithm
- Read-Solomon cyclic redundancy compression algorithm
- recognition algorithm
- recurrent algorithm
- recursive algorithm
- resilient propagation algorithm - routing algorithm
- Rprop algorithm
- RSA algorithm
- scheduling algorithm
- search algorithm
- search network algorithm - self-organizing algorithm
- semi-numerical algorithm
- sequential algorithm - shortest path algorithm
- sieving algorithm
- simulated annealing training algorithm
- simulation algorithm
- smoothing algorithm
- software algorithm
- spanning tree algorithm
- spline algorithm
- splitting algorithm
- stack algorithm
- statistical algorithm
- stochastic algorithm
- supervised training algorithm
- symmetric encryption algorithm
- time-wheel algorithm
- training algorithm
- universal algorithm
- unsupervised training algorithm
- van der Waerden algorithm
- variational algorithm
- vector distance algorithm
- Viterbi algorithm
- VLSI algorithm
- weighted quick-union algorithm
- working algorithm -
9 algorithm
1) алгоритм2) правило; процедура; метод•- Agarval-Cooley algorithm
- aim algorithm
- algorithm of doubtful convergence
- annealing algorithm
- asymmetric encryption algorithm
- autoregressive algorithm
- back propagation of error algorithm
- backoff algorithm
- batch algorithm
- Bellman-Ford algorithm
- best cost path algorithm
- bisection algorithm
- branch and bound algorithm
- British Telecom Lempel-Ziv algorithm
- BTLZ algorithm
- CART algorithm
- channel algorithm
- channel routing algorithm
- Cholesky algorithm
- classification and regression tree algorithm
- clustering algorithm
- Cochran-Orcutt algorithm
- compression algorithm
- conjugate directions algorithm
- conjugate gradients algorithm
- constructive algorithm
- contour following algorithm
- control algorithm
- convolution algorithm
- Cooley-Tuckey algorithm
- cryptographic algorithm
- deflation compression algorithm
- differential synthesis algorithm
- Diffie-Hellman algorithm
- digital signal processing algorithm
- digital signature algorithm
- Dijkstra algorithm
- distance vector algorithm
- DSP algorithm
- dynamic programming algorithm
- edge-tracking algorithm
- evolutionary algorithm
- exact embedding algorithm
- expansion algorithm
- fast algorithm
- fast convolution Agarval-Cooley algorithm
- fixed-weight algorithm
- Ford-Fulkerson algorithm
- fundamental algorithm
- fuzzy algorithm
- general algorithm
- genetic algorithm
- graph search algorithm
- greedy algorithm
- Gummel's algorithm
- hashing algorithm
- heuristic algorithm
- ID3 algorithm
- identification algorithm
- initialization algorithm
- integer algorithm
- international data encryption algorithm
- iterative algorithm
- iterative dichotomizer 3 algorithm
- k-means algorithm
- learning algorithm
- least frequently used algorithm
- least recently used algorithm
- Lee-algorithm
- Lee-Moore algorithm
- Lee-type algorithm
- Lempel-Ziv algorithm
- Lempel-Ziv-Welch algorithm
- Levenberg-Marquardt algorithm
- LFU algorithm
- line-probe algorithm
- link state algorithm
- LU decomposition algorithm
- LZ algorithm
- LZW algorithm
- MacQueen's k-means algorithm
- McCulloch-Pitts algorithm
- memetic algorithm
- message authentication algorithm
- metaheuristic algorithm
- min-cut algorithm
- modified Gram-Schmidt algorithm
- Nelder-Mead simplex algorithm
- nested algorithm
- numerical algorithm
- Oja iterative algorithm
- on-line algorithm
- optimization algorithm
- ordering algorithm
- painter's algorithm
- parallel algorithm
- pattern classification algorithm
- pattern recognition algorithm
- pel-recursive estimation algorithm
- placement algorithm
- planning algorithm
- polynomial algorithm
- predictive algorithm
- preemptive algorithm
- Prim algorithm
- production rule based algorithm
- pruning algorithm
- pseudo least recently used algorithm
- Q-R-algorithm
- quantum search algorithm
- quick-union algorithm with path compression
- quick-union algorithm
- radix sorting algorithm
- randomized algorithm
- rank algorithm
- Read-Solomon cyclic redundancy compression algorithm
- recognition algorithm
- recurrent algorithm
- recursive algorithm
- resilient propagation algorithm
- Rivest-Shamir-Adleman algorithm
- robust algorithm
- routing algorithm
- RProp algorithm
- RSA algorithm
- scheduling algorithm
- search algorithm
- search network algorithm
- secure hash algorithm
- selective-trace algorithm
- self-organizing algorithm
- semi-numerical algorithm
- sequential algorithm
- sequential leader clustering algorithm
- serial algorithm
- shortest path algorithm
- sieving algorithm
- simulated annealing training algorithm
- simulation algorithm
- smoothing algorithm
- software algorithm
- spanning tree algorithm
- spline algorithm
- splitting algorithm
- stack algorithm
- statistical algorithm
- stochastic algorithm
- supervised training algorithm
- symmetric encryption algorithm
- time-wheel algorithm
- training algorithm
- universal algorithm
- unsupervised training algorithm
- van der Waerden algorithm
- variational algorithm
- vector distance algorithm
- Viterbi algorithm
- VLSI algorithm
- weighted quick-union algorithm
- working algorithmThe New English-Russian Dictionary of Radio-electronics > algorithm
-
10 algorithm
= ALG II1) алгоритмматематическая функция или конечный чёткий набор описаний логической последовательности действий (правил, инструкций), необходимых для того, чтобы компьютер или интеллектуальное устройство выполнили за конечное время некоторую задачу, например, сжатие изображения, выбор оптимального маршрута пересылки пакета или шифрование данных. Алгоритм может быть описан блок-схемой. Термин происходит от имени древнеперсидского математика Мухаммеда ибн Муса аль Харезми, написавшего трактат, посвящённый алгоритмическому методу. Алгоритмы могут быть детерминированными (deterministic algorithm) или стохастическими (вероятностными) (stochastic algorithm). Детерминированный алгоритм для одинаковых наборов исходных (входных) данных даёт одинаковый результат.см. тж. algorithm design, algorithm validation, algorithmics, approximation algorithm, asymmetric algorithm, authentication algorithm, compression algorithm, computational algorithm, control algorithm, convolution algorithm, CRC algorithm, cryptoalgorithm, data-parallel algorithm, encryption algorithm, evolutionary algorithm, finite difference algorithm, flowchart, genetic algorithm, graphics algorithm, hashing algorithm, learning algorithm, matrix algorithm, Monte Carlo algorithm, Nagle algorithm, optimization algorithm, ordering algorithm, parallel algorithm, public-key algorithm, routing algorithm, scheduling algorithm, search algorithm, sequential algorithm, sort algorithm, theory of algorithms"The most fundamental concept in programming is the algorithm - a set of instructions for doing something" (Steve Lohr). — Наиболее фундаментальной концепцией в программировании является алгоритм - набор инструкций для достижения необходимого результата
2) метод, правилоАнгло-русский толковый словарь терминов и сокращений по ВТ, Интернету и программированию. > algorithm
-
11 hashing
Англо-русский толковый словарь терминов и сокращений по ВТ, Интернету и программированию. > hashing
-
12 hash algorithm
Англо-русский толковый словарь терминов и сокращений по ВТ, Интернету и программированию. > hash algorithm
-
13 SHA
сокр. от Secure Hash Algorithm; Secure Hashing Algorithm -
14 hash search
хэш-поиск, поиск с хешированиемсм. тж. hashing algorithmАнгло-русский толковый словарь терминов и сокращений по ВТ, Интернету и программированию. > hash search
См. также в других словарях:
Hashing — Eine Hashfunktion oder Streuwertfunktion ist eine Funktion bzw. Abbildung, die zu einer Eingabe aus einer üblicherweise großen Quellmenge eine Ausgabe, den Hashcode, erzeugt, meist aus einer kleineren Zielmenge. Die Hashwerte beziehungsweise… … Deutsch Wikipedia
Consistent hashing — is a special kind of hashing. In contrast, in most traditional hash tables, a change in the number of array slots causes nearly all keys to be remapped. By using consistent hashing, only K / n keys need to be remapped on average, where K is the… … Wikipedia
Double hashing — is a computer programming technique used in hash tables to resolve hash collisions, cases when two different values to be searched for produce the same hash key. It is a popular collision resolution technique in open addressed hash tables. Like… … Wikipedia
Locality sensitive hashing — (LSH) est une méthode de recherche approximative dans des espaces de grande dimension. C est une solution au problème de la malédiction de la dimension qui apparait lors d une recherche des plus proches voisins en grande dimension. L idée… … Wikipédia en Français
Cuckoo hashing — example. The arrows show the alternative location of each key. A new item would be inserted in the location of A by moving A to its alternative location, currently occupied by B, and moving B to its alternative location which is currently vacant … Wikipedia
Coalesced hashing — example. For purposes of this example, collision buckets are allocated in increasing order, starting with bucket 0. Coalesced hashing, also called coalesced chaining, is a strategy of collision resolution in a hash table that forms a hybrid of… … Wikipedia
Rabin-Karp string search algorithm — The Rabin Karp algorithm is a string searching algorithm created by Michael O. Rabin and Richard M. Karp in 1987 that uses hashing to find a substring in a text. It is used for multiple pattern matching rather than single pattern matching. For… … Wikipedia
Locality sensitive hashing — (LSH) is a method of performing probabilistic dimension reduction of high dimensional data. The basic idea is to hash the input items so that similar items are mapped to the same buckets with high probability (the number of buckets being much… … Wikipedia
Universal hashing — is a randomized algorithm for selecting a hash function F with the following property: for any two distinct inputs x and y , the probability that F(x)=F(y) (i.e., that there is a hash collision between x and y ) is the same as if F was a random… … Wikipedia
Pearson hashing — Fast Hashing of Variable Length Text Strings . Peter K. Pearson, Communications of the ACM 33(6), 677 (1990) mdash; [http://portal.acm.org/citation.cfm?id=78978 ACM full text (requires subscription)] ] is a hash function designed for fast… … Wikipedia
Randomized algorithm — Part of a series on Probabilistic data structures Bloom filter · Skip list … Wikipedia
